Large numbers, Knuth's arrow notation, and Ramsey theory
نویسنده
چکیده
In the childrens' book The Phantom Tollboothh by Norton Juster one can nd the following passage: Yes, please,, said Milo. Can you show me the biggest number there is?? I'd be delighted,, the Mathemagician] replied, opening one of the closet doors. We keep it right here. It took four miners just to dig it out.. Inside was the biggest 3 Milo had ever seen. It was fully twice as high as the Mathemagician. This is what children might consider to be a large number. The scope of this paper is to shed some light on numbers which adults in former times and now regard as large. Of course, the selection is arbitrary. 1 Large numbers a historical glimpse Numbers have always fascinated people. We start with a short look at the number system of the Romans and the Greeks which will lead us to Archimedes and to the largest number which appears in the literature of early occidental history. The German word Zahll (number) goes back to the Old High-German word zalaa, which in turn belongs (as also the English talee and the Dutch taall do)
منابع مشابه
Ordered and partially-ordered variants of Ramsey's theorem
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii PRELIMINARIES AND NOTATION . . . . . . . . . . . . . . . . . . . . . ix CHAPTER 1. OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 The Graph Ramsey Number . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Arrow Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 The Dir...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملEpsilon Numbers and Cantor Normal Form
An epsilon number is a transfinite number which is a fixed point of an exponential map: ω ε = ε. The formalization of the concept is done with use of the tetration of ordinals (Knuth's arrow notation, ↑↑). Namely, the ordinal indexing of epsilon numbers is defined as follows: ε0 = ω ↑↑ ω, εα+1 = εα ↑↑ ω, and for limit ordinal λ: ε λ = lim α<λ εα = α<λ εα. Tetration stabilizes at ω: α ↑↑ β = α ↑...
متن کاملiii Contents Preface
Preface These are the notes based on the course on Ramsey Theory taught at Univer-sität Hamburg in Summer 2011. The lecture was based on the textbook " Ramsey theory " of Graham, Rothschild, and Spencer [44]. In fact, large part of the material is taken from that book. iii Contents Preface iii Chapter 1. Introduction 1 1.1. A few cornerstones in Ramsey theory 1 1.2. A unifying framework 4 1.3. ...
متن کاملHigher-Order Recursion Abstraction: How to Make Ackermann, Knuth and Conway Look Like a Bunch of Primitives, Figuratively Speaking
The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming contradiction, there are generalized notions of total recursion, for which the Ackermann function is in fact primitive recursive, and often featured as a wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 133 شماره
صفحات -
تاریخ انتشار 2002